An Improved Secure Elliptic Curve Scalar Multiplication Algorithm over Prime Fields

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Fast and Secure Elliptic Curve Scalar Multiplication Over Prime Fields Using Special Addition Chains

In this paper, we propose a new fast and secure point multiplication algorithm. It is based on a particular kind of addition chains involving only additions (no doubling), providing a natural protection against side channel attacks. Moreover, we propose new addition formulae that take into account the specific structure of those chains making point multiplication very efficient.

متن کامل

Speeding Scalar Multiplication of Elliptic Curve over GF(2mn)

Lee et al. proposed two methods to speed up the computation of scalar multiplication of elliptic curve defined over GF (2) with a medium size of m in the range 10 ≤ m ≤ 20. In these methods, Frobenius map is utilized to expand the integer k and each coefficient of the expansion is represented as a binary string. In this paper, with the application of joint sparse form (JSF) to the coefficients,...

متن کامل

Elliptic Curve Scalar Multiplication Combining Yao's Algorithm and Double Bases

In this paper we propose to take one step back in the use of double base number systems for elliptic curve point scalar multiplication. Using a modified version of Yao’s algorithm, we go back from the popular double base chain representation to a more general double base system. Instead of representing an integer k as Pn i=1 2 i3i where (bi) and (ti) are two decreasing sequences, we only set a ...

متن کامل

Elliptic-curve scalar multiplication algorithm using ZOT structure

The computation of P over elliptic curves is the dominant operation. It depends on the representation of the scalar . The binary method is the standard unsigned method that is used to compute the elliptic curve point . Researchers found that it is not the most efficient way for implementing elliptic curve computations. Other recoding methods such as CR, NAF, and MOF were presented in order to e...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Energy Procedia

سال: 2011

ISSN: 1876-6102

DOI: 10.1016/j.egypro.2011.11.140